A data focusing algorithm with monotone regression and positive semi-definite constraint features

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for the Positive Semi-definite Procrustes Problem

For arbitrary real matrices F and G, the positive semi-deenite Procrustes problem is minimization of the Frr obenius norm of F ? PG with respect to positive semi-deenite symmetric P. Existing solution algorithms are based on a convex programming approach. Here an unconstrained non-convex approach is taken, namely writing P = E 0 E and optimizing with respect to E. The main result is that all lo...

متن کامل

Homogenization of Viscoplastic Models of Monotone Type with Positive Semi-Definite Free Energy

Using the periodic unfolding method we construct the homogenization theory for the quasistatic initial boundary value problems with internal variables, which model the deformation behavior of viscoplastic materials with a periodic microstructure. The free energy associated with models is assumed to be positive semi-definite only.

متن کامل

Positive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems

In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...

متن کامل

A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization

  We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...

متن کامل

GENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS

A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 1988

ISSN: 0895-7177

DOI: 10.1016/0895-7177(88)90631-0